ar X iv : q - b io . Q M / 0 31 10 37 v 1 2 7 N ov 2 00 3 Hierarchical Clustering Using Mutual Information
نویسنده
چکیده
We present a method for hierarchical clustering of data called mutual information clustering (MIC) algorithm. It uses mutual information (MI) as a similarity measure and exploits its grouping property: The MI between three objects X, Y, and Z is equal to the sum of the MI between X and Y , plus the MI between Z and the combined object (XY ). We use this both in the Shannon (probabilistic) version of information theory and in the Kolmogorov (algorithmic) version. We apply our method to the construction of phylogenetic trees from mitochondrial DNA sequences and to the output of independent components analysis (ICA) as illustrated with the ECG of a pregnant woman.
منابع مشابه
ar X iv : q ua nt - p h / 04 11 17 2 v 1 2 3 N ov 2 00 4 Information and Entropy in Quantum Theory
متن کامل
ar X iv : n uc l - th / 0 41 10 95 v 1 2 3 N ov 2 00 4 Θ + pentaquark in the nuclear medium
We study the interaction of the Θ + pentaquark with nuclear matter associated to the KN decay channels and to the two meson cloud. We find that the potential is attractive and could be strong enough to lead to the existence of Θ + nuclear bound states.
متن کاملar X iv : q ua nt - p h / 06 11 18 7 v 1 1 7 N ov 2 00 6 Philosophical Aspects of Quantum Information Theory
2 First steps with quantum information 3 2.1 Bits and qubits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 The no-cloning theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Quantum cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.3.1 Key Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Entanglement-as...
متن کاملar X iv : m at h / 06 02 50 8 v 2 [ m at h . G R ] 1 9 N ov 2 00 7 PRESENTATIONS OF FINITE SIMPLE GROUPS : A QUANTITATIVE APPROACH
There is a constant C 0 such that all nonabelian finite simple groups of rank n over Fq, with the possible exception of the Ree groups 2 G 2 (3 2e+1), have presentations with at most C 0 generators and relations and total length at most C 0 (log n + log q). As a corollary, we deduce a conjecture of Holt: there is a constant C such that dim H 2 (G, M) ≤ C dim M for every finite simple group G, e...
متن کاملar X iv : m at h . Q A / 0 61 10 87 v 1 3 N ov 2 00 6 MODULAR FUNCTORS ARE DETERMINED BY THEIR GENUS ZERO DATA
We prove in this paper that the genus zero data of a modular functor determines the modular functor. We do this by establishing that the S-matrix in genus onewith one point labeled arbitrarily can be expressed in terms of the genus zero information and we give an explicit formula. We do not assume the modular functor in question has duality or is unitary, in order to establish this. CONTENTS
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006